Representation learning on textual network with personalized PageRank
نویسندگان
چکیده
منابع مشابه
The Effect of Visual Representation, Textual Representation, and Glossing on Second Language Vocabulary Learning
In this study, the researcher chose three different vocabulary techniques (Visual Representation, Textual Enhancement, and Glossing) and compared them with traditional method of teaching vocabulary. 80 advanced EFL Learners were assigned as four intact groups (three experimental and one control group) through using a proficiency test and a vocabulary test as a pre-test. In the visual group, stu...
متن کاملLeadership groups on Social Network Sites based on Personalized PageRank
The Online Social Networking phenomenon is growing rapidly all around the world. As a consequence, in recent years, several studies have been devoted to the analysis of Social Network Sites (SNSs). A specific issue that has been addressed is the identification of leaders based on well-known algorithms such as PageRank [1], [2], [3]. In this talk we give a new method to identify leaders on an SN...
متن کاملPersonalized PageRank Solution Paths
Personalized PageRank vectors used for many community detection and graph diffusion problems have a subtle dependence on a parameter epsilon that controls their accuracy. This parameter governs the sparsity of the solution and can be interpreted as a regularization parameter. We study algorithms to estimate the solution path as a function of the sparsity and propose two methods for this task. T...
متن کاملParallel Personalized Pagerank on Dynamic Graphs
Personalized PageRank (PPR) is a well-known proximity measure in graphs. To meet the need for dynamic PPR maintenance, recent works have proposed a local update scheme to support incremental computation. Nevertheless, sequential execution of the scheme is still too slow for highspeed stream processing. Therefore, we are motivated to design a parallel approach for dynamic PPR computation. First,...
متن کاملNetwork Capacity Bound for Personalized PageRank in Multimodal Networks
In a former paper [13] the concept of Bipartite PageRank was introduced and a theorem on the limit of authority flowing between nodes for personalized PageRank has been generalized. In this paper we want to extend those results to multimodal networks. In particular we introduce a hypergraph type that may be used for describing multimodal network where a hyperlink connects nodes from each of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2021
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-020-2934-6